منابع مشابه
Corrections to "Shuffled Iterative Decoding"
In the above paper [1], the second paragraph of the introduction was accidentally omitted. This paragraph and corresponding citations should appear as follows. As for iterative decoding of LDPC codes, there are two main scheduling approaches, probabilistic approaches and deterministic approaches. Although both scheduling approaches provide better complexity/performance tradeoff than their stand...
متن کاملReplica Shuffled Belief Propagation Decoding of LDPC Codes
Replica shuffled belief propagation decoders of low-density parity-check codes are presented. The proposed decoders converge faster than standard and shuffled belief propagation decoders. Simulations show that the new decoders offer good performance versus complexity trade-offs. This work may not be copied or reproduced in whole or in part for any commercial purpose. Permission to copy in whole...
متن کاملIterative Decoding / Demodulation
A receiver structure suitable for coded M-ary DPSK signals on static and time-varying channels is investigated. The transmitter consists of a convolutional code, an interleaver, and a diierential encoder, and hence represents a type of \serial turbo code". In the receiver, the kernel is an a posteriori probability (APP) demodulator. A priori information is accepted and reliability outputs are p...
متن کاملNoncoherent iterative (turbo) decoding
Recently, noncoherent sequence detection schemes for coded linear and continuous phase modulations have been proposed, which deliver hard decisions by means of a Viterbi algorithm. The current trend in digital transmission systems toward iterative decoding algorithms motivates an extension of these schemes. In this paper, we propose two noncoherent soft-output decoding algorithms. The first sol...
متن کاملIterative Decoding Using Replicas
Replica shuffled versions of iterative decoders of low-density parity-check codes and turbo codes are presented in this paper. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and EXIT charts, are used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulations show that the new schedules of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Communications
سال: 2005
ISSN: 0090-6778
DOI: 10.1109/tcomm.2004.841982